Rules for the Identification Portfolio-incompatible Requests in Dynamic Vehicle Routing
نویسندگان
چکیده
For regular patient transportation and emergency transportation with ambulance vehicles a dy-namic dial-a-ride (DARP) problem has to be solved. We analyze two scheduling strategies for theregular dial-a-ride orders in order to minimize routing costs and to maximize transportation qual-ity. Furthermore, we review practical requirements and suggest a conceptual architecture for adecision support system based on a customary control center system as basis for future businessservices.Major results of this contribution are two promising and efficient solution procedures suitable for asimplified bi-objective version of the dynamic DARP and tested with real-world problem instances.
منابع مشابه
Rules for the Identification of Portfolio-Incompatible Requests in Dynamic Vehicle Routing
In this article, we propose and evaluate simple rules for selecting transport requests that do not fit into a request portfolio because their temporal or spatial requirements are incompatible with the requirements of other request so that the compilation of profitable routes is compromised. We integrate these rules into an adaptive online vehicle operations planning system and analyze in numeri...
متن کاملOffline-Online Approximate Dynamic Programming for Dynamic Vehicle Routing with Stochastic Requests
Although increasing amounts of transaction data make it possible to characterize uncertainties surrounding customer service requests, few methods integrate predictive tools with prescriptive optimization procedures to meet growing demand for small-volume urban transport services. We incorporate temporal and spatial anticipation of service requests into approximate dynamic programming (ADP) proc...
متن کاملA Memetic Algorithm for the Vehicle Routing Problem with Cross Docking
In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respe...
متن کاملITLS - WP - 06 - 10 Pricing in Dynamic Vehicle Routing Problems
The principal focus of this paper is to study carrier pricing decisions for a new type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the Vehicle Routing Problem in a Competitive Environment (VRPCE), as an extension of the Traveling Salesman Problem with Profits (TSPP) to a dynamic competitive auction environment. In the VRPCE, the carrier mu...
متن کاملPricing in Dynamic Vehicle Routing Problems
The principal focus of this paper is to study carrier pricing decisions for a type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the Vehicle Routing Problem in a Competitive Environment (VRPCE), as an extension of the Traveling Salesman Problem with Profits (TSPP) to a dynamic competitive auction environment. In the VRPCE, the carrier must e...
متن کامل